From TWEAK to PWEAK: Reducing the Non Linear PLanning Framework
نویسندگان
چکیده
The TWEAK system (Chapman 87) is a very nice synthesis of a long trend in planning and Artificial Intelligence, including STRIPS (Fikes & Nilsson 71). We derive a correctness criterion which is simpler that the one used for TWEAK since it does not involve modal operators and does not introduce neither white knights nor separation. This criterion is compared to the one of TWEAK and other related works. We then derive a correct and complete planning procedure from this criterion, as it was done for TWEAK. The resulting planner is proved correct (it finds good plans), complete (it can find all possible plans with appropriate control) and shall always stop with a solution if there exists one. Moreover, this planner avoids some looping problems of TWEAK. This planner is implemented in Prolog and Lisp. From TWEAK to PWEAK: Reducing the Non Linear PLanning Framework Laforia Technical Report 90/29, December 1990.
منابع مشابه
Nonlinear Planning: A Rigorous Reconstruction
The problem of achieving several goals simultaneously lias been central to domain-independent planning research, the nonlinear constraint-posting approach has been most successful Previous planners of this type ''. 4, 5. f> have been complicated, heuristic, and ill-defined. 1 have combined and distilled the state of the art into a simple, precise, implemented algorithm (TWEAK) which I have prov...
متن کاملOptimization of Mixed-Integer Non-Linear Electricity Generation Expansion Planning Problem Based on Newly Improved Gravitational Search Algorithm
Electricity demand is forecasted to double in 2035, and it is vital to address the economicsof electrical energy generation for planning purposes. This study aims to examine the applicability ofGravitational Search Algorithm (GSA) and the newly improved GSA (IGSA) for optimization of themixed-integer non-linear electricity generation expansion planning (GEP) problem. The performanceindex of GEP...
متن کاملA Comparison of the SNLP and TWEAK Planning Algorithms
Most current partial-order planning systems are based on either the TWEAK or SNLP planning algorithms. Both planning algorithms are complete and correct. The SNLP algorithm distinguishes itself from TWEAK in that it is also systematic, so it never generates redundant plans in its search space. This paper compares the two planning algorithms and shows that SNLP’S systematicity property does not ...
متن کاملA Single Machine Capacitated Production Planning Problem Under Uncertainty: A Grey Linear Programming Approach
The production planning is an important problem in most of manufacturing systems in practice. Unlike many researches existing in literature, this problem encounters with great uncertainties in parameters and input data. In this paper, a single machine capacitated production planning problem is considered and a linear programming formulation is presented. The production costs are assumed to be u...
متن کاملDominance and Subsumption in Constraint-Posting Planning
Abs t rac t By integrating a dominance prover into the plan search process, the traditional constraint-posting planning paradigm can be generalised to permit partially satisfiable goals. In this approach, the view of planning as theorem proving is retained, although the emphasis is on proving theorems about dominance relations on classes of candidate plans. Plan classes are generated by posting...
متن کامل